Projection semantics for rigid loops
نویسندگان
چکیده
A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax of the program algebra PGA. Two different semantic projections are provided and proven equivalent. One of these is taken to have definitional status on the basis of two criteria: ‘normative semantic adequacy’ and ‘indicative algorithmic adequacy’.
منابع مشابه
ar X iv : 0 70 7 . 10 59 v 1 [ cs . P L ] 6 J ul 2 00 7 Projection semantics for rigid loops ∗
A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax of the program algebra PGA. Two different semantic projections are provided and proven equivalent. One of these is taken to have definitional status on the basis of two criteria: ‘normative semantic adequacy’ and ‘indi...
متن کاملProjections: A Technique for Verifying Real-Time Programs in Duration Calculus
We present a technique for handling the true synchrony hypothesis and (infinite) loops in real-time programming. The technique is based on the notion of projections and iterations in Duration Calculus. With this technique, the semantics of real-time programs with shared variables is given in a simple way, and the verification can be done using DC∗ proof system.
متن کاملA novel Local feature descriptor using the Mercator projection for 3D object recognition
Point cloud processing is a rapidly growing research area of computer vision. Introducing of cheap range sensors has made a great interest in the point cloud processing and 3D object recognition. 3D object recognition methods can be divided into two categories: global and local feature-based methods. Global features describe the entire model shape whereas local features encode the neighborhood ...
متن کاملRefinement Semantics and Loop Rules
Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for w h i l e-loops, f o r-loops, and loops with intermediate and deep exits. We illustrate the use of these rules with examples. Springer-Verlag 1999. to appear in LNCS for FM'99
متن کاملUsing Loops in Genetic Programming for a Two Class Binary Image Classification Problem
Loops are rarely used in genetic programming (GP), because they lead to massive computation due to the increase in the size of the search space. We have investigated the use of loops with restricted semantics for a problem in which there are natural repetitive elements, that of distinguishing two classes of images. Using our formulation, programs with loops were successfully evolved and perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0707.1059 شماره
صفحات -
تاریخ انتشار 2006